Topology Reconstruction of Dynamical Networks via Constrained Lyapunov Equations

The network structure (or topology) of a dynamical network is often unavailable or uncertain. Hence, we consider the problem of network reconstruction. Network reconstruction aims at inferring the topology of a dynamical network using measurements obtained from the network. In this technical note we define the notion of solvability of the network reconstruction problem. Subsequently, we provide necessary and sufficient conditions under which the network reconstruction problem is solvable. Finally, using constrained Lyapunov equations, we establish novel network reconstruction algorithms, applicable to general dynamical networks. We also provide specialized algorithms for specific network dynamics, such as the well-known consensus and adjacency dynamics.Comment: 8 page

A Distance-Based Approach to Strong Target Control of Dynamical Networks

This paper deals with controllability of dynamical networks. It is often unfeasible or unnecessary to fully control large-scale networks, which motivates the control of a prescribed subset of agents of the network. This specific form of output control is known under the name target control. We consider target control of a family of linear control systems associated with a network, and provide both a necessary and a sufficient topological condition under which the network is strongly targeted controllable. Furthermore, a leader selection algorithm is presented to compute leader sets achieving target control

Towards observer-based fault detection and isolation for branched water distribution networks without cycles

This paper addresses the observer-based, diagonal, fault detection and isolation (FDI) problem for branched water distribution networks without cycles. Specifically, it provides a linear, time-invariant, state-space model for water contamination in such networks based on one-dimensional mass balance and a necessary and sufficient solvability condition for the aforementioned FDI problem. The latter is based on a graph-theoretic characterization of the rank of the model's transfer matrix, which allows one to check for solvability just by analyzing the fault-output paths in the directed graph associated to the model